An Intrusion Detection System for Drone Swarming Utilizing Timed Probabilistic Automata
نویسندگان
چکیده
Unmanned aerial vehicles (UAVs), commonly known as drones, have found extensive applications across diverse sectors, such agriculture, delivery, surveillance, and military. In recent times, drone swarming has emerged a novel field of research, which involves multiple drones working in collaboration towards shared objective. This innovation holds immense potential transforming the way we undertake tasks, including military operations, environmental monitoring, search rescue missions. However, emergence swarms also brings new security challenges, they can be susceptible to hacking intrusion. To address these concerns, propose utilizing timed probabilistic automata (TPA)-based intrusion detection system (IDS) model normal behavior identify any deviations that may indicate an IDS is particularly efficient adaptable detecting different types attacks swarming. Its ability adapt evolving attack patterns zero-day makes it invaluable tool protecting from malicious attacks.
منابع مشابه
Intrusion Detection Systems Utilizing System Call
Form Approved OMB No. 0704-0188 Public reporting burden for this collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing this collection of information. Send comments regarding this burden estimate or any other aspect of this coll...
متن کاملConcavely-Priced Probabilistic Timed Automata
Concavely-priced probabilistic timed automata, an extension of probabilistic timed automata, are introduced. In this paper we consider expected reachability, discounted, and average price problems for concavely-priced probabilistic timed automata for arbitrary initial states. We prove that these problems are EXPTIME-complete for probabilistic timed automata with two or more clocks and PTIME-com...
متن کاملModel Checking Probabilistic Timed Automata
Probabilistic timed automata are an extension of timed automata with discrete probability distributions. We consider model-checking algorithms for the subclasses of probabilistic timed automata which have one or two clocks. Firstly, we show that PCTL probabilistic model-checking problems (such as determining whether a set of target states can be reached with probability at least 0.99 regardless...
متن کاملInformation Flow Analysis for Probabilistic Timed Automata
In multilevel systems it is important to avoid unwanted indirect information flow from higher levels to lower levels, namely the so called covert channels. Initial studies of information flow analysis were performed by abstracting away from time and probability. Recently, work has been done in order to consider also aspects either of time or of probability, but not both. In this paper we propos...
متن کاملWeak bisimulation for Probabilistic Timed Automata
We are interested in describing timed systems that exhibit probabilistic behaviour. To this purpose, we consider a model of Probabilistic Timed Automata and introduce a concept of weak bisimulation for these automata, together with an algorithm to decide it. The weak bisimulation relation is shown to be preserved when either time, or probability is abstracted away. As an application, we use wea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Drones
سال: 2023
ISSN: ['2504-446X']
DOI: https://doi.org/10.3390/drones7040248